An Exponential Lower Bound on the Size of a Binary Moment Diagram Representing Integer Division
نویسندگان
چکیده
A binary moment diagram, which was proposed for arithmetic circuit verification, is a directed acyclic graph representing a function from binary-vectors to integers (f : {0, 1}n → Z). A multiplicative binary moment diagram is an extension of a binary moment diagram with edge weights attached. A multiplicative binary moment diagram can represent addition, multiplication and many other functions with polynomial numbers of vertices. Lower bounds for division, however, had not been investigated. In this paper, we show an exponential lower bound on the number of vertices of a multiplicative binary moment diagram representing a quotient function or a remainder function. key words: binary moment diagram, division, lower bound
منابع مشابه
KUIS - 96 - 0002 An Exponential Lower Bound of the Size of OBDDs
The size of the Ordered Binary Decision Diagram (OBDD) which represents a Boolean function greatly depends on the ordering of input variables. In this paper, we show that the size of the OBDD representing n-bits integer division is (2 n=8 ) even if any variable ordering is allowed to minimize the size of the OBDD. We also show that _-OBDDs and ^-OBDDs representing division have the same lower b...
متن کاملExponential Lower Bounds on the Size ofOBDDs Representing
An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is (2 (n?i)=8) for any variable ordering. We also show that _-OBDDs, ^-OBDDs and-OBDDs representing integer division h...
متن کاملAn Exponential Lower Bound of the Size of OBDDs Representing Division
1 Introduction The size of an OBDD [1] largely depends on the variable ordering. It is important to clarify the lower bounds of OBDDs representing arithmetic functions. In this report, we investigate a lower bound of the size of OBDDs representing integer division. More precisely, we focus on each bit of the output of the n-bit / n-bit division, and prove that the size of OBDDs representing the...
متن کاملOn the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism
Branching Programs (BPs) are a well-established computation and representation model for Boolean functions. Although exponential lower bounds for restricted BPs such as Read-Once Branching Programs (BP1s) have been known for a long time, the proof of lower bounds for important selected functions is sometimes difficult. Especially the complexity of fundamental functions such as integer multiplic...
متن کاملProve that a faulty multiplier is faulty ! ? Sandro
Formal verification of integer multipliers was an open problem for a long time as the size of any reduced ordered binary decision diagram (BDD) [1] which represents integer multiplication is exponential in the width of the operands [2]. In 1995, Bryant and Chen [4] introduced multiplicative binary moment diagrams (*BMD) which is a canonical data structure for pseudo Boolean functions allowing a...
متن کامل